Coupon collector’s problem and its extensions in extreme value framework

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Hypergeometric Coupon Collection Problem and its Dual

Suppose an urn contains M balls, of different types, which are removed from the urn in a uniform random manner. In the hypergeometric coupon collection problem, we are interested in the set of balls that have been removed at the moment when at least one ball of each type has been removed. In its dual, we are interested in the set of removed balls at the first moment that this set contains all o...

متن کامل

high volatility, thick tails and extreme value theory in value at risk estimation: the case of liability insurance in iran insurance company

در این بررسی ابتدا به بررسی ماهیت توزیع خسارات پرداخته میشود و از روش نظریه مقادیر نهایی برای بدست آوردن برآورد ارزش در معرض خطر برای خسارات روزانه بیمه مسئولیت شرکت بیمه ایران استفاده میشود. سپس کارایی نظریه مقدار نهایی در برآورد ارزش در معرض خطر با کارایی سایر روشهای واریانس ، کواریانس و روش شبیه سازی تاریخی مورد مقایسه قرار میگیرد. نتایج این بررسی نشان میدهند که توزیع ،garch شناخته شده مدل...

15 صفحه اول

Benefits of Cooperation in Multiplayer Coupon Collectors' Games

The paper introduces a modified version of the classical Coupon Collector’s Problem entailing exchanges and cooperation between multiple players. Results of the development show that, within a proper Markov framework, the complexity of the Cooperative Multiplayer Coupon Collectors’ Problem can be attacked with an eye to the modeling of social strategies and community behaviors. The cost of coop...

متن کامل

Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search

This paper introduces a unified framework for the analysis of a class of random allocation processes thdt include: (i) the birthday paradox; (ii) the coupon collector problem* (iii) least-tecently-used (LRU) caching in memory management systems under the independent reference model; (iv) the move-to-front heuristic of self-organizing search. All analyses are relative to general nonuniform f rob...

متن کامل

Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold

The problem of determining the unsatisfiability threshold for random 3-SAT formulas consists in determining the clause to variable ratio that marks the (experimentally observed) abrupt change from almost surely satisfiable formulas to almost surely unsatisfiable. Up to now, there have been rigorously established increasingly better lower and upper bounds to the actual threshold value. An upper ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Statistics and Its Interface

سال: 2014

ISSN: 1938-7989,1938-7997

DOI: 10.4310/sii.2014.v7.n3.a8